Unary Constraints for Efficient Context-Free Parsing

نویسندگان

  • Nathan Bodenstab
  • Kristy Hollingshead
  • Brian Roark
چکیده

We present a novel pruning method for context-free parsing that increases efficiency by disallowing phrase-level unary productions in CKY chart cells spanning a single word. Our work is orthogonal to recent work on “closing” chart cells, which has focused on multi-word constituents, leaving span-1 chart cells unpruned. We show that a simple discriminative classifier can learn with high accuracy which span-1 chart cells to close to phrase-level unary productions. Eliminating these unary productions from the search can have a large impact on downstream processing, depending on implementation details of the search. We apply our method to four parsing architectures and demonstrate how it is complementary to the cell-closing paradigm, as well as other pruning methods such as coarse-to-fine, agenda, and beam-search pruning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

USAEnhanced Constraint Dependency Grammar Parsers

Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism which has a weak generative capacity beyond context-free grammars and supports a very exible parsing algorithm for working with feature grammars; however, the running time of the parser is O(n 4). Hence, we have investigated how to improve the running time of the parser by applying feature constraints diierentially ...

متن کامل

Enhanced Constraint Dependency Grammar Parsers

Constraint Dependency Grammar CDG is a constraint based grammatical formalism that has a weak generative capacity beyond context free gram mars and supports a very exible parsing algorithm for working with feature grammars however the running time of the parser is O n Hence we have investi gated how to improve the running time of the parser by applying feature constraints di erentially and by u...

متن کامل

Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees

The problem of parsing ambiguous structures concerns (i) their representation and (ii) the specification of mechanisms allowing to delay and control their evaluation. We first propose to use a particular kind of disjunctions called controlled disjunctions: these formulae allows the representation and the implementation of specific constraints that can occur between ambiguous values. But an effi...

متن کامل

PCFG Parsing for Restricted Classical Chinese Texts

The Probabilistic Context-Free Grammar (PCFG) model is widely used for parsing natural languages, including Modern Chinese. But for Classical Chinese, the computer processing is just commencing. Our previous study on the part-of-speech (POS) tagging of Classical Chinese is a pioneering work in this area. Now in this paper, we move on to the PCFG parsing of Classical Chinese texts. We continue t...

متن کامل

An Optimized Parsing Algorithm Well Suited to RNA Folding

The application of stochastic context-free grammars to the determination of RNA foldings allows a simple description of the sub-class of sought secondary structures, but it needs efficient parsing algorithms. The more classic thermodynamic model of folding, popularized by Zuker under the framework of dynamic programming algorithms, allows an easy computation of foldings but its use is delicate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011